package com.github.kezhenxu94.playground.leetcode;

/**
 * 237. Delete Node in a Linked List
 *
 * Write a function to delete a node (except the tail) in a singly linked list, 
 * given only access to that node.
 *
 * Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third
 * node with value 3, the linked list should become 1 -> 2 -> 4 after calling 
 * your function.
 */
public class Solution237DeleteNodeInALinkedList {

	public void deleteNode(ListNode node) {
		ListNode p = node;
		while (node.next != null) {
			node.val = node.next.val;
			p = node;
			node = node.next;
		}
		p.next = null;
	}
}
